Revisiting cosmography via Gaussian process
نویسندگان
چکیده
Abstract In this paper, we revisit the kinematical state of our Universe via cosmographic approach by using Gaussian process, where minimum assumption is cosmological principle, i.e. Friedmann–Lemaître–Robertson–Walker metric. A obviously distinguished feature that these cosmography parameters are free any gravity theories and models. And process independent specific parameterized forms function. Thus transformations generic can be used to constrain a model dark energy directly at kinematics level Universe. As result, series up fifth oder, Hubble parameter H ( z ), deceleration q jerk j snap s ) lerk l evolve with respect redshift reconstructed from cosmic observations which include recently released Pantheon+ SN Ia samples observational data also dubbed as chronometers. The result shows transition decelerated expansion an accelerated $$z_t=0.652^{+0.054}_{-0.043}$$ z t = 0 . 652 - 0.043 + 0.054 consistent previous results.
منابع مشابه
Revisiting Gaussian Process Dynamical Models
The recently proposed Gaussian process dynamical models (GPDMs) have been successfully applied to time series modeling. There are four learning algorithms for GPDMs: maximizing a posterior (MAP), fixing the kernel hyperparameters ᾱ (Fix.ᾱ), balanced GPDM (B-GPDM) and twostage MAP (T.MAP), which are designed for model training with complete data. When data are incomplete, GPDMs reconstruct the m...
متن کاملScalable Gaussian Process Classification via Expectation Propagation
Variational methods have been recently considered for scaling the training process of Gaussian process classifiers to large datasets. As an alternative, we describe here how to train these classifiers efficiently using expectation propagation (EP). The proposed EP method allows to train Gaussian process classifiers on very large datasets, with millions of instances, that were out of the reach o...
متن کاملLearning Gaussian Process Kernels via Hierarchical Bayes
We present a novel method for learning with Gaussian process regression in a hierarchical Bayesian framework. In a first step, kernel matrices on a fixed set of input points are learned from data using a simple and efficient EM algorithm. This step is nonparametric, in that it does not require a parametric form of covariance function. In a second step, kernel functions are fitted to approximate...
متن کاملSparse Gaussian Process Regression via L1 Penalization
To handle massive data, a variety of sparse Gaussian Process (GP) methods have been proposed to reduce the computational cost. Many of them essentially map the large dataset into a small set of basis points. A common approach to learn these basis points is evidence maximization. Nevertheless, evidence maximization may lead to overfitting and cause a high computational cost. In this paper, we pr...
متن کاملInverse Reinforcement Learning via Deep Gaussian Process
We propose a new approach to inverse reinforcement learning (IRL) based on the deep Gaussian process (deep GP) model, which is capable of learning complicated reward structures with few demonstrations. Our model stacks multiple latent GP layers to learn abstract representations of the state feature space, which is linked to the demonstrations through the Maximum Entropy learning framework. Inco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Physical Journal C
سال: 2023
ISSN: ['1434-6044', '1434-6052']
DOI: https://doi.org/10.1140/epjc/s10052-023-11545-4